Ontology Based Rule Acquisition from similar Web with Knuth Morris Pratt Algorithm
نویسنده
چکیده
Rule acquisition is also an important issue, and the Web that implies inferential rules can be a major source of rule acquisition. It is not easier to acquire rules from a site by using similar rules of other sites in the same domain. Here it proposed an automatic rule acquisition procedure using an ontology, named RuleToOnto, that includes information about the rule components and their structures. The rule acquisition procedure consists of the privacy preserving rule component identification step and the rule composition step. Then A* algorithm is developed for the rule composition. By using Knuth-morris-pratt Algorithm (Kmp), it finds the string is present in pattern and to select exact parts that contain rules from Web pages. The Result demonstrating that our ontology-based rule acquisition approach works in a real-world application. Keywords—Rule acquisition, rule ontology, best-first search, KMP algorithm.
منابع مشابه
Efficient validation and construction of Knuth–Morris–Pratt arrays
Knuth-Morris-Pratt (KMP) arrays are known as the ”failure function” of the Knuth-Morris-Pratt string matching algorithm. We present an algorithm to check if an integer array is a KMP array. This gives a method for computing all the distinct KMP arrays.
متن کاملProgramming by Expression Refinement: the KMP Algorithm
The exercise is to calculate a pattern-matching algorithm, and specifically the algorithm originally due to Knuth, Morris, and Pratt [0]. We begin, however, with a smaller problem, one that turns out to be both similar to, and a subproblem of, the larger problem. We prefer to start with this because it will give the reader a chance to become familiar in a simple setting with the style and notat...
متن کاملEnhancing Partial Deduction via Unfold/Fold Rules
We show that sometimes partial deduction produces poor program specializations because of its limited ability in (i) dealing with conjunctions of recursively deened predicates, (ii) combining partial evaluations of alternative computations, and (iii) taking into account unii-cation failures. We propose to extend the standard partial deduction technique by using versions of the deenition rule an...
متن کاملOn Boyer-Moore Preprocessing
Probably the two best-known exact string matching algorithms are the linear-time algorithm of Knuth, Morris and Pratt (KMP), and the fast on average algorithm of Boyer and Moore (BM). The efficiency of these algorithms is based on using a suitable failure function. When a mismatch occurs in the currently inspected text position, the purpose of a failure function is to tell how many positions th...
متن کاملText Data Linkage of Different Entities Using Occt-One Class Clustering Tree
A new one to many and many to many data linkage is based on a One-Class Clustering Tree (OCCT) which characterizes the entities that should be linked together. It is evaluated using datasets of Data leakage prevention, Recommender system and Fraud detection. The tree is built such that it is easy to understand and transform into Association rules. The Data Linkage is closely related to entity r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014